A ug 2 01 5 Two descent statistics over 321 - avoiding centrosymmetric involutions

نویسندگان

  • Marilena Barnabei
  • Flavio Bonetti
  • Sergi Elizalde
  • Matteo Silimbani
چکیده

Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n+1− i) = 2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum of the positions of these descents. Our results are based on two new bijections, one between centrosymmetric involutions in S2n and subsets of {1, . . . , n}, and another one showing that certain statistics on Young diagrams that fit inside a rectangle are equidistributed. We also use the latter bijection to refine a result from [1] stating that the distribution of the major index on 321-avoiding involutions is given by the q-analogue of the central binomial coefficients.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Descent Statistics over 321-Avoiding Centrosymmetric Involutions

Centrosymmetric involutions in the symmetric group S2n are permutations π such that π = π−1 and π(i) + π(2n + 1 − i) = 2n + 1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the ...

متن کامل

Equidistribution and Sign-Balance on 321-Avoiding Permutations

Let Tn be the set of 321-avoiding permutations of order n. Two properties of Tn are proved: (1) The last descent and last index minus one statistics are equidistributed over Tn, and also over subsets of permutations whose inverse has an (almost) prescribed descent set. An analogous result holds for Dyck paths. (2) The sign-and-last-descent enumerators for T2n and T2n+1 are essentially equal to ...

متن کامل

Major Index over Descent for Pattern-avoiding Permutations

An open conjecture in pattern avoidance theory is that the distribution of the major index among 321-avoiding permutations is distributed unimodally. We construct a formula for this distribution, and in the case of 2 descents prove unimodality, with unimodality for 3 through 5 descents likely being little more complicated. The formula refines the q-analogue of the Frame-Robinson-Thrall hookleng...

متن کامل

ar X iv : m at h / 02 06 16 9 v 1 [ m at h . C O ] 1 7 Ju n 20 02 SOME STATISTICS ON RESTRICTED 132 INVOLUTIONS

In [GM] Guibert and Mansour studied involutions on n letters avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary pattern on k letters. They also established a bijection between 132-avoiding involutions and Dyck word prefixes of same length. Extending this bijection to bilateral words allows to determine more parameters; in particular, we consider the...

متن کامل

Excedances and Descents of Bi-increasing Permutations

Motivated by the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that these (socalled bi-increasing) permutations are just the 321-avoiding ones. The paper investigates their excedance and descent structure. In particular, we give some combinatorial interpretatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015